Constructing Infinite Words of Intermediate Complexity
نویسنده
چکیده
We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential. The first one is rather simple but produces a word which is not uniformly recurrent. The second construction, more involved, produces uniformly recurrent words and allows to choose the growth of the complexity function in a large family.
منابع مشابه
A note on constructing infinite binary words with polynomial subword complexity
Most of the constructions of infinite words having polynomial subword complexity are quite complicated, e.g., sequences of Toeplitz, sequences defined by billiards in the cube, etc. In this paper, we describe a simple method for constructing infinite words w over a binary alphabet {a, b} with polynomial subword complexity pw. Assuming w contains an infinite number of a’s, our method is based on...
متن کاملConstructing partial words with subword complexities not achievable by full words
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match, or are compatible with, all letters in the alphabet ((full) words are just partial words without holes). The subword complexity function of a partial word w over a finite alphabet A assigns to each positive integer, n, the number, pw(n), of distinct full words over A that are compati...
متن کاملBlowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
We consider methods for constructing NP-intermediate problems under the assumption that P 6= NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-i...
متن کاملErgodic Infinite Permutations of Minimal Complexity
An infinite permutation can be defined as a linear ordering of the set of natural numbers. Similarly to infinite words, a complexity p(n) of an infinite permutation is defined as a function counting the number of its factors of length n. For infinite words, a classical result of Morse and Hedlind, 1940, states that if the complexity of an infinite word satisfies p(n) ≤ n for some n, then the wo...
متن کاملOn the Computational Complexity of Infinite Words
This paper contains answers to several problems in the theory of the computational complexity of infinite words. We show that the problem whether all infinite words generated by iterating dgsm’s have logarithmic space complexity is equivalent to the open problem asking whether the unary classes of languages in P and in DLOG are equivalent. Similarly, the problem to find a concrete infinite word...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002